Vulnerability bounds on the number of spanning tree leaves
نویسندگان
چکیده
منابع مشابه
On a Spanning Tree with Specified Leaves
Let k ≥ 2 be an integer. We show that if G is a (k + 1)-connected graph and each pair of nonadjacent vertices in G has degree sum at least |G| + 1, then for each subset S of V (G) with |S| = k, G has a spanning tree such that S is the set of endvertices. This result generalizes Ore’s theorem which guarantees the existence of a Hamilton path connecting any two vertices.
متن کاملOn the Number of Leaves of a Euclidean Minimal Spanning Tree
Let Vk,n be the number of vertices of degree k in the Euclidean minimal spanning tree of Xi, 1 < i n, where the Xi are independent, absolutely continuous random variables with values in Rd. It is proved that n -Vkn converges with probability 1 to a constant ak,dIntermediate results provide information about how the vertex degrees of a minimal spanning tree change as points are added or deleted,...
متن کاملOn the Theoretical bounds of the Spanning Tree Algorithm
The Spanning Tree Algorithm is the base of the link layer protocols like STP or RSTP. These are used in Ethernet bridges networks to eliminate loops by building a logical communication tree on top of the physical network. Even though it is an automatic and robust algorithm, its recovery time is too large. And as Ethernet is being extended to provider networks applications, very strict requireme...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2009
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.37.5b9